Most automorphisms of a hyperbolic group have very simple dynamics

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dynamics of free group automorphisms

We present a coarse convexity result for the dynamics of free group automorphisms: Given an automorphism φ of a finitely generated free group F , we show that for all x ∈ F and 0 ≤ i ≤ N , the length of φ(x) is bounded above by a constant multiple of the sum of the lengths of x and φ (x), with the constant depending only on φ.

متن کامل

On Marginal Automorphisms of a Group Fixing the Certain Subgroup

Let W be a variety of groups defined by a set W of laws and G be a finite p-group in W. The automorphism α of a group G is said to bea marginal automorphism (with respect to W), if for all x ∈ G, x−1α(x) ∈ W∗(G), where W∗(G) is the marginal subgroup of G. Let M,N be two normalsubgroups of G. By AutM(G), we mean the subgroup of Aut(G) consistingof all automorphisms which centralize G/M. AutN(G) ...

متن کامل

Hyperbolic automorphisms of free groups

We prove that an automorphism φ : F → F of a finitely generated free group F is hyperbolic in the sense of Gromov if it has no nontrivial periodic conjugacy classes. This result was previously claimed (but not proved) in [BF92].

متن کامل

Automorphisms of Free Groups Have Asymptotically Periodic Dynamics

We show that every automorphism α of a free group Fk of finite rank k has asymptotically periodic dynamics on Fk and its boundary ∂Fk: there exists a positive power α such that every element of the compactum Fk ∪ ∂Fk converges to a fixed point under iteration of α . Further results about the dynamics of α as well as an extension from Fk to word-hyperbolic groups are given in the later sections.

متن کامل

Cubic graphs with most automorphisms

Let G be a connected simple cubic graph; Aut G denotes its automorphism group. Let n be half the number of vertices of G. We define the arithmetic genus of a (possibly disconnected) graph as e−v+1 where e is the number of edges, v the number of vertices of G). For a connected simple cubic graph, g = n+1. The definition of arithmetic genus is motivated by the following: to a projective nodal cur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annales Scientifiques de l'École Normale Supérieure

سال: 2000

ISSN: 0012-9593

DOI: 10.1016/s0012-9593(00)00120-8